基于混合建模方法的三维彩色树木快速模拟算法

在对多种模型进行研究的基础上，提出了一种快速模拟三维彩色树木的高效算法。该算法不仅合理简化了树木的几何拓扑结构和生长规律特性，而且引入了特性良好、计算简单、参数易于控制的随机函数。因此生成树木的种类较多、图形逼真、速度很快，在普通微机上达到了实时的模拟效果。     

What you should know about the vehicle routing problem

In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

(H)型映射的拓扑度及其应用

本文将(S)_+型映射度的有关理论扩展到(H)型映射类。基于经典的Brouwer度理论,笔者构造了(H)型映射的拓扑度,所得结果进一步丰富和发展了非线性单调型映射度理论。     

一类污染环境下扩散种群周期解的存在性

研究了两斑块中一个斑块受到污染的一类种群系统,通过运用Gaines和M awh in重合度延拓定理,得到了系统周期解存在的一个充分条件。     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

一种基于随机映射的战斗效能模型

利用随机映射概念提出了一种新的战斗毁伤模型形式———Lanchester战斗网络模型。模型是由一个阶递减的随机映射序列组成的随机有向二部图,它明确、形式地描述了战争整体行为与局部作用之间的关系。理论分析和计算获得的结论表明,模型描述的整体作战效能符合Lanchester平方律,其网络拓扑结构是非同质的,出度和入度分布服从指数幂律。应用模型定量对比了“对称”与“非对称”战斗中全局信息因素对战斗系统整体效能的影响。初步讨论了网络模型研究在战争建模理论、实证和计算方法论上的意义。     

一种基于混沌的数字水印算法研究

基于混沌对初值的敏感性和混沌伪随机序列的唯一性,以DCT变换为工具,给出了混沌数字水印生成及嵌入的算法,兼顾了水印的鲁棒性和透明性。实验结果表明,该方法提高了水印图像的不可见性和鲁棒性,具有极强的抗攻击性。     

拓扑度理论之近期发展

这是一篇综述文章,介绍了拓扑度理论近十年来的主要成果。     

A concave‐cost production planning problem with remanufacturing options

We focus on the concave‐cost version of a production planning problem where a manufacturer can meet demand by either producing new items or by remanufacturing used items. Unprocessed used items are disposed. We show the NP‐hardness of the problem even when all the costs are stationary. Utilizing the special structure of the extreme‐point optimal solutions for the minimum concave‐cost problem with a network flow type feasible region, we develop a polynomial‐time heuristic for the problem. Our computational study indicates that the heuristic is a very efficient way to solve the problem as far as solution speed and quality are concerned. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012